#include <bits/stdc++.h>
using namespace std;

const int N = 505;

int n, k, m;
int res;
char s[N], p[N];

bool check()
{
	int cnt = 0;
}

void dfs(int step, int pos)
{
	if (step == m)
	{
		if (check())
			res++;
			
		return;
	}
		
}

int main()
{
	freopen("bracket.in", "r", stdin);
	freopen("bracket.out", "w", stdout);
	 
	scanf("%d%d", &n, &k);
	cin >> s + 1;
	
	memcpy(p, s, sizeof p);
	
	for (int i = 1; i <= n; i++)
	{
		if (s[i] == '?')
			m++;
	}
	
	dfs(0, 0);
}
